Congestion management by determining optimal location of series FACTS devices using hybrid bacterial foraging and Nelder–Mead algorithm

In this paper, the Thyristor-Controlled Series-Compensated (TCSC) devices are located for congestion management in the power system by considering the non-smooth fuel cost function and penalty cost of emission. For this purpose, it is considered that the objective function of the proposed optimal power flow (OPF) problem is minimizing fuel and emission penalty cost of generators. A hybrid method that is the combination of the bacterial foraging (BF) algorithm with Nelder–Mead (NM) method (BF-NM) is employed to solve the OPF problems. The optimal location of the TCSC devices are then determined for congestion management. The size of the TCSC is obtained by using of the BF-NM algorithm to minimize the cost of generation, cost of emission, and cost of TCSC. The simulation results on IEEE 30-bus, modified IEEE 30-bus and IEEE 118-bus test system confirm the efficiency of the proposed method for finding the optimal location of the TCSC with non-smooth non-convex cost function and emission for congestion management in the power system. In addition, the results clearly show that a better solution can be achieved by using the proposed OPF problem in comparison with other intelligence methods.     

FluNet: A hybrid internet simulator for fast queue regimes

Motivated by the scale and complexity of simulating large-scale networks, recent research has focused on hybrid fluid/packet simulators, where fluid models are combined with packet models in order to reduce simulation complexity as well as to track dynamics of end-sources accurately. However, these simulators still need to track the queuing dynamics of network routers, leading to considerable simulation complexity in a large-scale network model. In this paper, we propose a new hybrid simulator – FluNet – where queueing dynamics are not tracked, but instead, an equivalent rate-based model is used. The FluNet simulator is predicated on a fast-queueing regime at bottleneck routers, where the queue length fluctuates on a faster time-scale than end systems. This allows us to simulate large-scale systems, where the simulation “time step-size” is governed only by the time-scale of the end-systems, and not by that of the intermediate routers; whereas a queue-tracking based fluid simulator would require decreasingly smaller step-sizes as the system scale size increases. We validate our model using a ns-2 based implementation. Our results indicate a good match between packet systems and the associated FluNet system.     

受约束且TCP友好的拥塞控制研究

提出了一种使用RTP／RTCP来收集信息的TCP友好的流控算法。当前的多媒体源对发送速率能够调整的粒度和上下限都有要求。本文提出的算法不仅满足了流控算法的TCP友好（TCP－friendly）的特性，还考虑了多媒体源的这些限制。提出的流控算法能够调整的步长是阶梯的。最后还对TCP友好的流控算法和它的约束算法进行了仿真，并分析了结果。     

A real-time road pricing system: The case of a two-link parallel network

A real-time road pricing system in the case of a two-link parallel network is proposed in this paper. The system that is based on a combination of Dynamic Programming and Neural Networks makes “on-line” decisions about road toll values. In the first phase of the proposed model, the best road toll sequences during certain time period are calculated off-line for many different patterns of vehicle arrivals. These toll sequences are computed using Dynamic Programming approach. In the second phase, learning from vehicle arrival patterns and the corresponding optimal toll sequences, neural network is trained. The results obtained during on-line tests are close to the best solution obtained off-line assuming that the arrival pattern is known.     

TCP协议在卫星网络中的问题研究

由于TCP协议直接应用到卫星网络中将可能会导致网络性能下降,因此针对卫星网络的特点,分析了传播时延、高误码率、非对称连接方式等特点对TCP协议性能的影响,对主要解决方法进行了分析、比较现有的几种解决方法利弊,应根据具体应用采用相应的解决方案。     

Multi-indicator Active Queue Management Method

A considerable number of applications are running over IP networks. This increased the contention on the network resource, which ultimately results in congestion. Active queue management (AQM) aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance. AQM methods implement different techniques in accordance with congestion indicators, such as queue length and average queue length. The performance of the network is evaluated using delay, loss, and throughput. The gap between congestion indicators and network performance measurements leads to the decline in network performance. In this study, delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM. The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability, which is responsible for managing the router buffer. The experimental results, based on two sets of experiments, have shown that the proposed method outperformed the existing benchmark algorithms including RED, ERED and BLUE algorithms. For instance, in the first experiment, the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms. In addition, the proposed method outperformed the benchmark algorithms in terms of packet loss, packet dropping, and packet retransmission. Overall, the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.     

浅谈TCP拥塞控制与其改进思路

如今网络已经离不开人们的生活,发展势头迅猛,网络的终端设备不仅在数量上,种类也越来越多,在此发展之下,保证大量的网络数据传输与网络性能相协调是极其重要的,经典的TCP拥塞控制机制是网络发展历史中人们想出的一种解决网络拥塞的方法,但如何适应当今网络发展的需求相信还是靠人们不断的探索来寻找合适的答案。本文致力于对经典TCP拥塞控制机制的讨论并提出相应的改进思路     

RED的网络性能研究*

在很多网络中, 支持新的拥塞避免机制( 如RED 和ECN) 的节点将会和支持传统丢尾缓存( Drop-Tail) 的节点共存。研究含有两个拥塞节点的混杂网络中TCP 流集的性能, 比较了几种控制算法的数据流公平性, 仿真结果显示采用Adaptive 算法并不能增加数据流的公平性; 仿真也显示混杂网络中单个RED 参数的设置情况会影响整个网络的性能, 具体可以从网络吞吐量、响应时间等判断。RED 的参数设置在双瓶颈情况下再次变得重要, 正如在单瓶颈的情况下一样。     

Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks

In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.     

图书馆多媒体信息资源网络的自适应传输控制方法

为了增强图书馆多媒体信息的稳健传输和多媒体信息网络的鲁棒性、稳定性,提出了一种新颖的RED策略。最小阈值(minth)和最大阈值(maxth)能够随着缓存队列的平均占用率的变化动态调整,而不再是预设的固定参数。改进后,ATRED对路由器队列的控制力度能够根据网络环境的变化自适应调整,使得队长方差减小,队列振荡变小,网络更加稳定,能够在复杂多变的网络环境下提供更加可靠的服务。